On co-counter-fragments of automata
نویسندگان
چکیده
This paper contains results related to synthesis and presentation of abstract automata by fragments of behaviour and investigates the structure of the classes of finite connected initial output-less automata specified by systems of defining relations considered as fragments, co-fragments, counter-fragments and co-counter-fragments of automata.
منابع مشابه
Model Checking Freeze LTL over One-Counter Automata
We study complexity issues related to the model-checking problem for LTL with registers (a.k.a. freeze LTL) over one-counter automata. We consider several classes of one-counter automata (mainly deterministic vs. nondeterministic) and several syntactic fragments (restriction on the number of registers and on the use of propositional variables for control locations). The logic has the ability to...
متن کاملThe complexity of bisimilarity-checking for one-counter processes
We study the problem of bisimilarity-checking between processes of one-counter automata and finite-state processes. We show that deciding weak bisimilarity between processes of one-counter nets (which are ‘restricted’ one-counter automata where the counter cannot be tested for zero) and finite-state processes is DP-hard. In particular, this means that the problem is both NP and co-NP hard. The ...
متن کاملModel checking memoryful linear-time logics over one-counter automata
We study complexity of the model-checking problems for LTL with registers (also known as freeze LTL and written LTL) and for first-order logic with data equality tests (written FO(∼, <,+1)) over one-counter automata. We consider several classes of one-counter automata (mainly deterministic vs. nondeterministic) and several logical fragments (restriction on the number of registers or variables a...
متن کاملEfficient Verification Algorithms for One-Counter Processes
We study the problem of strong/weak bisimilarity between processes of one-counter automata and finite-state processes. We show that the problem of weak bisimilarity between processes of one-counter nets (which are ‘weak’ one-counter automata) and finite-state processes is DP-hard (in particular, it means that the problem is both NP and co-NP hard). The same technique is used to demonstrate co-N...
متن کاملIntroducing New Structures for D-Type Latch and Flip-Flop in Quantum-Dot Cellular Automata Technology and its Use in Phase-Frequency Detector, Frequency Divider and Counter Circuits
Quantum-dot cellular automata (QCA) technology is an alternative to overcoming the constraints of CMOS technology. In this paper, a new structure for D-type latch is presented in QCA technology with set and reset terminals. The proposed structure, despite having the set and reset terminals, has only 35 quantum cells, a delay equal to half a cycle of clocks and an occupied area of 39204 nm2. T...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1712.05227 شماره
صفحات -
تاریخ انتشار 2017